System and Method for Prioritizing Store Instructions

ABSTRACT

The present invention provides a system and method for prioritizing store instructions in a cascaded pipeline. The system includes a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other. The system further includes circuitry configured to: (1) receive an issue group of instructions; (2) determine if at least one store instruction is in the issue group, if so scheduling the least one store instruction in a one of the plurality of execution pipelines based upon a first prioritization scheme; (3) determine if there is an issue conflict for one of the plurality of execution pipelines and resolving the issue conflict by scheduling the at least one store instruction in a different execution pipeline; (4) schedule execution of the issue group of instructions in the cascaded delayed execution pipeline unit.

CROSS-CROSS-REFERENCE TO RELATED APPLICATION

This application is related to co-pending U.S. Patent applications entitled “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070374US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE” filed on XX/XX/XX, by David Arnold Luick et al., having Attorney docket # ROC920070375US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR RESOLVING ISSUE CONFLICTS OF LOAD INSTRUCTIONS” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070558US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR PRIORITIZING FLOATING-POINT INSTRUCTIONS” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070559US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR PRIORITIZING ARITHMETIC INSTRUCTIONS” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070560US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR THE SCHEDULING OF LOAD INSTRUCTIONS WITHIN A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070562US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE ” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070686US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR RESOLVING ISSUE CONFLICTS OF LOAD INSTRUCTIONS” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070688US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR PRIORITIZING COMPARE INSTRUCTIONS” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070689US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR PRIORITIZING BRANCH INSTRUCTIONS” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070691US1 and accorded Ser. No. [xx/xxx,xxx], “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE” filed on XX/XX/XX, by David Arnold Luick, having Attorney docket # ROC920070693US1 and accorded Ser. No. [xx/xxx,xxx], all of which are entirely incorporated herein by reference.

BACKGROUND OF THE INVENTION Field of the Invention

The present invention generally relates to executing instructions in a processor. Specifically, this application is related to prioritizing store instructions in a cascaded pipeline.

DESCRIPTION OF BACKGROUND

Currently, modern computer systems typically contain several integrated circuits (ICs), including a processor which may be used to process information in the computer system. The data processed by a processor may include computer instructions which are executed by the processor as well as data which is manipulated by the processor using the computer instructions. The computer instructions and data are typically stored in a main memory in the computer system.

Processors typically process instructions by executing the instruction in a series of small steps. In some cases, to increase the number of instructions being processed by the processor (and therefore increase the speed of the processor), the processor may be pipelined. Pipelining refers to providing separate stages in a processor where each stage performs one or more of the small steps necessary to execute an instruction. In some cases, the pipeline (in addition to other circuitry) may be placed in a portion of the processor referred to as the processor core. Some processors may have multiple processor cores, and in some cases, each processor core may have multiple pipelines. Where a processor core has multiple pipelines, groups of instructions (referred to as issue groups) may be issued to the multiple pipelines in parallel and executed by each of the pipelines in parallel.

As an example of executing instructions in a pipeline, when a first instruction is received, a first pipeline stage may process a small part of the instruction. When the first pipeline stage has finished processing the small part of the instruction, a second pipeline stage may begin processing another small part of the first instruction while the first pipeline stage receives and begins processing a small part of a second instruction. Thus, the processor may process two or more instructions at the same time (in parallel).

To provide for faster access to data and instructions as well as better utilization of the processor, the processor may have several caches. A cache is a memory which is typically smaller than the main memory and is typically manufactured on the same die (i.e., chip) as the processor. Modern processors typically have several levels of caches. The fastest cache which is located closest to the core of the processor is referred to as the Level 1 cache (L1 cache). In addition to the L1 cache, the processor typically has a second, larger cache, referred to as the Level 2. Cache (L2 cache). In some cases, the processor may have other, additional cache levels (e.g., an L3 cache and an L4 cache).

To provide the processor with enough instructions to fill each stage of the processor's pipeline, the processor may retrieve instructions from the L2 cache in a group containing multiple instructions, referred to as an instruction line (I-line). The retrieved I-line may be placed in the L1 instruction cache (I-cache) where the core of the processor may access instructions in the I-line. Blocks of data (D-lines) to be processed by the processor may similarly be retrieved from the L2 cache and placed in the L1 cache data cache (D-cache).

The process of retrieving information from higher cache levels and placing the information in lower cache levels may be referred to as fetching, and typically requires a certain amount of time (latency). For instance, if the processor core requests information and the information is not in the L1 cache (referred to as a cache miss), the information may be fetched from the L2 cache. Each cache miss results in additional latency as the next cache/memory level is searched for the requested information. For example, if the requested information is not in the L2 cache, the processor may look for the information in an L3 cache or in main memory.

In some cases, a processor may process instructions and data faster than the instructions and data are retrieved from the caches and/or memory. For example, where an instruction being executed in a pipeline attempts to access data which is not in the D-cache, pipeline stages may finish processing previous instructions while the processor is fetching a D-line which contains the data from higher levels of cache or memory. When the pipeline finishes processing the previous instructions while waiting for the appropriate D-line to be fetched, the pipeline may have no instructions left to process (referred to as a pipeline stall). When the pipeline stalls, the processor is underutilized and loses the benefit that a pipelined processor core provides.

Because the address of the desired data may not be known until the instruction is executed, the processor may not be able to search for the desired D-line until the instruction is executed. However, some processors may attempt to prevent such cache misses by fetching a block of D-lines which contain data addresses near (contiguous to) a data address which is currently being accessed. Fetching nearby D-lines relies on the assumption that when a data address in a D-line is accessed, nearby data addresses will likely also be accessed as well (this concept is generally referred to as locality of reference). However, in some cases, the assumption may prove incorrect, such that data in D-lines which are not located near the current D-line are accessed by an instruction, thereby resulting in a cache miss and processor inefficiency.

Accordingly, there is a need for improved methods and apparatus for executing instructions and retrieving data in a processor which utilizes cached memory.

SUMMARY OF THE INVENTION

Embodiments of the present invention provide a system and method for prioritizing store instructions in a cascaded pipeline. Briefly described, in architecture, one embodiment of the system, among others, can be implemented as follows.

The system includes a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other. The system further includes circuitry configured to: (1) receive an issue group of instructions; (2) determine if at least one store instruction is in the issue group, if so scheduling the least one store instruction in a one of the plurality of execution pipelines based upon a first prioritization scheme; (3) determine if there is an issue conflict for one of the plurality of execution pipelines and resolving the issue conflict by scheduling the at least one store instruction in a different execution pipeline; (4) schedule execution of the issue group of instructions in the cascaded delayed execution pipeline unit.

Embodiment of the present invention can also be viewed as providing methods for prioritizing store instructions in a cascaded pipeline. In this regard, one embodiment of such a method, among others, can be broadly summarized by the following steps. The method includes scheduling execution of an instruction in a processor having at least one cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other. The method further includes (1) receiving an issue group of instructions; (2) determining if at least one store instruction is in the issue group, if so scheduling the least one store instruction in a one of the plurality of execution pipelines based upon a first prioritization scheme; (3) determining if there is an issue conflict for one of the plurality of execution pipelines; (4) resolving the issue conflict by scheduling one store instruction causing the issue conflict in a different execution pipeline; and (5) scheduling execution of the issue group of instructions in the cascaded delayed execution pipeline unit.

Additional features and advantages are realized through the techniques of the present invention. Other embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed invention. For a better understanding of the invention with advantages and features, refer to the description and to the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:

FIG. 1 is a block diagram depicting a system according to one embodiment of the invention.

FIG. 2 is a block diagram depicting a computer processor according to one embodiment of the invention.

FIG. 3 is a block diagram depicting one of the cores of the processor according to one embodiment of the invention.

FIG. 4 is a block diagram depicting an instruction prioritization circuitry according to one embodiment of the invention.

FIG. 5 is a flow chart illustrating an example of the operation of store instructions prioritization process for executing instructions in the delayed execution pipeline according to one embodiment of the invention.

The detailed description explains the preferred embodiments of the invention, together with advantages and features, by way of example with reference to the drawings.

DETAILED DESCRIPTION OF THE INVENTION

For cascaded delayed pipeline issue, instructions are in general assigned to the leftmost possible delayed pipeline that will cause zero instruction execution bubbles; loads have the highest priority for this assignment, then floating-point instructions are the second highest priority, then arithmetic instructions (ALU and MAD ops) are the third highest priority. Stores are the fourth highest priority, branches are the fifth highest priority, and compares are assigned last and in general may be assigned to any delayed pipeline without loss of performance. The apparatus and method to implement this optimization within a group priority issue scheme for cascaded pipelines are described in commonly assigned and co-pending U.S. Patent Application (Attorney Docket ROC920070374US1) entitled “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE”, Ser. No. xx/xxxxxx filed on, xxxx,xx, 2008, and U.S. Patent Application (Attorney Docket ROC920070374US1) entitled “SYSTEM AND METHOD FOR A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE”, Ser. No. xx/xxxxxx filed on, xxxx,xx, 2008, are both herein incorporated by reference.

By executing the instruction in the delayed execution pipeline, and by initiating the L2 cache access when the instruction is issued, the data targeted by the instruction may be retrieved, if necessary, from the L2 cache in time for the instruction to use the data without stalling execution of the instruction.

Sometimes, multiple store instructions will want to be assigned to the same delayed pipeline. In this disclosure, a priority scheme is invoked which ranks various types of store instructions attributes into a number of categories. The store instructions priorities include parameters such as a store instruction of a semaphore (highest priority), a store instruction update to the stack (i.e. auto increment to stack pointer) (second highest priority), a store instruction with dependent use of address (i.e. auto increment of an address) (third highest priority), a store instruction having address dependence (fourth highest priority), a store of a load with an address conflict (fifth highest priority), a store instruction with an update that is not to the stack (sixth highest priority), a store instruction of fixed, floating-point, floating graphic instructions (seventh highest priority), a store instruction defined as being end of dependent chain store instruction or nearly end of dependent chain store instruction (eight highest priority); and, lastly, the lowest priority store instruction is defined as being an independent store instruction with no dependency.

A second priority scheme is applied if any issue conflicts exist. In one embodiment, the store instructions with issue conflicts are prioritized based upon program order. For example, those store instructions with an issue conflict are prioritized in the order that the program code originally ordered them. In another embodiment, the priority of store instructions with issue conflicts are determined by dependency chain depths or how many dependent loads/ALU instructions will follow this store instruction. In still another embodiment, the store instructions with issue conflicts can be prioritized based upon the stall delayed penalty.

So, based on these priorities, lower priority store instructions will be assigned to a more delayed pipeline than the original zero bubble method had determined. But also, cases exist where two similar high priority store instructions want to be naively assigned to the same leftmost possible pipeline, but the second of these two store instructions will alternatively be scheduled in the next instruction group with the current instruction group terminated.

The present invention generally provides a mechanism and method for a priority scheme which ranks various types of store instructions attributes into a number of categories. In one embodiment, a method of scheduling execution of an instruction in a processor is provided. The processor may have at least one cascaded delayed execution pipeline unit having two or more execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other.

In the following, reference is made to embodiments of the invention. However, it should be understood that the invention is not limited to specific described embodiments. Instead, any combination of the following features and elements, whether related to different embodiments or not, is contemplated to implement and practice the invention. Furthermore, in various embodiments the invention provides numerous advantages over the prior art. However, although embodiments of the invention may achieve advantages over other possible solutions and/or over the prior art, whether or not a particular advantage is achieved by a given embodiment is not limiting of the invention. Thus, the following aspects, features, embodiments and advantages are merely illustrative and are not considered elements or limitations of the appended claims except where explicitly recited in the claim(s). Likewise, reference to “the invention” shall not be construed as a generalization of any inventive subject matter disclosed herein and shall not be considered to be an element or limitation of the appended claims except where explicitly recited in a claim(s).

The following is a detailed description of embodiments of the invention depicted in the accompanying drawings. The embodiments are examples and are in such detail as to clearly communicate the invention. However, the amount of detail offered is not intended to limit the anticipated variations of embodiments; but on the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present invention as defined by the appended claims.

Embodiments of the invention may be utilized with and are described below with respect to a system, e.g., a computer system. As used herein, a system may include any system utilizing a processor and a cache memory, including a personal computer, internet appliance, digital media appliance, portable digital assistant (PDA), portable music/video player and video game console. While cache memories may be located on the same die as the processor which utilizes the cache memory, in some cases, the processor and cache memories may be located on different dies (e.g., separate chips within separate modules or separate chips within a single module).

While described below with respect to a processor having multiple processor cores and multiple L1 caches, wherein each processor core uses multiple pipelines to execute instructions, embodiments of the invention may be utilized with any processor which utilizes a cache, including processors which have a single processing core. In general, embodiments of the invention may be utilized with any processor and are not limited to any specific configuration. Furthermore, while described below with respect to a processor having an L1-cache that is divided into an L1 instruction cache (L1 I-cache, or I-cache) and an L1 data cache (L1 D-cache, or D-cache), embodiments of the invention may be utilized in configurations wherein a unified L1 cache is utilized.

FIG. 1 is a block diagram illustrating an example of a computer 11 utilizing the store instruction prioritization process 200 of the present invention. Computer 11 includes, but is not limited to, PCs, workstations, laptops, PDAs, palm devices and the like. Generally, in terms of hardware architecture, as shown in FIG. 1, the computer 11 include a processor 41, memory 42, and one or more input and/or output (I/O) devices (or peripherals) that are communicatively coupled via a local interface 43. The local interface 43 can be, for example but not limited to, one or more buses or other wired or wireless connections, as is known in the art. The local interface 43 may have additional elements, which are omitted for simplicity, such as controllers, buffers (caches), drivers, repeaters, and receivers, to enable communications. Further, the local interface 43 may include address, control, and/or data connections to enable appropriate communications among the aforementioned components.

The processor 41 is a hardware device for executing software that can be stored in memory 42. The processor 41 can be virtually any custom made or commercially available processor, a central processing unit (CPU), data signal processor (DSP) or an auxiliary processor among several processors associated with the computer 11, and a semiconductor based microprocessor (in the form of a microchip) or a macroprocessor. Examples of suitable commercially available microprocessors are as follows: a PowerPC microprocessor from IBM, U.S.A., an 80x86 or Pentium series microprocessor from Intel Corporation, U.S.A., a Sparc microprocessor from Sun Microsystems, Inc, a PA-RISC series microprocessor from Hewlett-Packard Company, U.S.A., or a 68xxx series microprocessor from Motorola Corporation, U.S.A.

The memory 42 can include any one or combination of volatile memory elements (e.g., random access memory (RAM, such as dynamic random access memory (DRAM), static random access memory (SRAM), etc.)) and nonvolatile memory elements (e.g., ROM, erasable programmable read only memory (EPROM), electronically erasable programmable read only memory (EEPROM), programmable read only memory (PROM), tape, compact disc read only memory (CD-ROM), disk, diskette, cartridge, cassette or the like, etc.). Moreover, the memory 42 may incorporate electronic, magnetic, optical, and/or other types of storage media. Note that the memory 42 can have a distributed architecture, where various components are situated remote from one another, but can be accessed by the processor 41.

The software in memory 42 may include one or more separate programs, each of which comprises an ordered listing of executable instructions for implementing logical functions. In the example illustrated in FIG. 1, the software in the memory 42 includes a suitable operating system (O/S) 51. The operating system 51 essentially controls the execution of other computer programs, and provides scheduling, input-output control, file and data management, memory management, and communication control and related services.

A non-exhaustive list of examples of suitable commercially available operating systems 51 is as follows (a) a Windows operating system available from Microsoft Corporation; (b) a Netware operating system available from Novell, Inc.; (c) a Macintosh operating system available from Apple Computer, Inc.; (e) a UNIX operating system, which is available for purchase from many vendors, such as the Hewlett-Packard Company, Sun Microsystems, Inc., and AT&T Corporation; (d) a Linux operating system, which is freeware that is readily available on the Internet; (e) a run time Vxworks operating system from WindRiver Systems, Inc.; or (f) an appliance-based operating system, such as that implemented in handheld computers or personal data assistants (PDAs) (e.g., Symbian OS available from Symbian, Inc., PalmOS available from Palm Computing, Inc., and Windows CE available from Microsoft Corporation).

The I/O devices may include input devices, for example but not limited to, a mouse 44, keyboard 45, scanner (not shown), microphone (not shown), etc. Furthermore, the I/O devices may also include output devices, for example but not limited to, a printer (not shown), display 46, etc. Finally, the I/O devices may further include devices that communicate both inputs and outputs, for instance but not limited to, a NIC or modulator/demodulator 47 (for accessing remote devices, other files, devices, systems, or a network), a radio frequency (RF) or other transceiver (not shown), a telephonic interface (not shown), a bridge (not shown), a router (not shown), etc.

If the computer 11 is a PC, workstation, intelligent device or the like, the software in the memory 42 may further include a basic input output system (BIOS) (omitted for simplicity). The BIOS is a set of essential software routines that initialize and test hardware at startup, start the O/S 51, and support the transfer of data among the hardware devices. The BIOS is stored in some type of read-only-memory, such as ROM, PROM, EPROM, EEPROM or the like, so that the BIOS can be executed when the computer 11 is activated.

When the computer 11 is in operation, the processor 41 is configured to execute software stored within the memory 42, to communicate data to and from the memory 42, and to generally control operations of the computer 11 are pursuant to the software. The O/S 51 and any other program are read, in whole or in part, by the processor 41, perhaps buffered within the processor 41, and then executed.

According to one embodiment of the invention, the processor 41 may have an L2 cache 61 as well as multiple L1 caches 71, with each L1 cache 71 being utilized by one of multiple processor cores 81. According to one embodiment, each processor core 81 may be pipelined, wherein each instruction is performed in a series of small steps with each step being performed by a different pipeline stage.

FIG. 2 is a block diagram depicting a processor 41 according to one embodiment of the invention. For simplicity, FIG. 2 depicts and is described with respect to a single processor core 81 of the processor 41. In one embodiment, each processor core 81 may be identical (e.g., contain identical pipelines with identical pipeline stages). In another embodiment, each processor core 81 may be different (e.g., contain different pipelines with different stages).

In one embodiment of the invention, the L2 cache may contain a portion of the instructions and data being used by the processor 41. In some cases, the processor 41 may request instructions and data which are not contained in the L2 cache 61. Where requested instructions and data are not contained in the L2 cache 61, the requested instructions and data may be retrieved (either from a higher level cache or system memory 42) and placed in the L2 cache. When the processor core 81 requests instructions from the L2 cache 61, the instructions may be first processed by a predecoder and scheduler 63 (described below in greater detail).

In one embodiment of the invention, instructions may be fetched from the L2 cache 61 in groups, referred to as I-lines. Similarly, data may be fetched from the L2 cache 61 in groups referred to as D-lines. The L1 cache 71 depicted in FIG. 1 may be divided into two parts, an L1 instruction cache 72 (L1 I-cache 72) for storing I-lines as well as an L1 data cache 74 (D-cache 74) for storing D-lines. I-lines and D-lines may be fetched from the L2 cache 61 using L2 access circuitry 62.

In one embodiment of the invention, I-lines retrieved from the L2 cache 61 may be processed by a predecoder and scheduler 63 and the I-lines may be placed in the L1 I-cache 72. To further improve processor performance, instructions are often predecoded, for example, I-lines are retrieved from L2 (or higher) cache. Such predecoding may include various functions, such as address generation, branch prediction, and scheduling (determining an order in which the instructions should be issued), which is captured as dispatch information (a set of flags) that control instruction execution. In some cases, the predecoder and scheduler 63 may be shared among multiple processor cores 81 and L1 caches. Similarly, D-lines fetched from the L2 cache 61 may be placed in the D-cache 74. A bit in each I-line and D-line may be used to track whether a line of information in the L2 cache 61 is an I-line or D-line. Optionally, instead of fetching data from the L2 cache 61 in I-lines and/or D-lines, data may be fetched from the L2 cache 61 in other manners, e.g., by fetching smaller, larger, or variable amounts of data.

In one embodiment, the L1 I-cache 72 and D-cache 74 may have an I-cache directory 73 and D-cache directory 75 respectively to track which I-lines and D-lines are currently in the L1 I-cache 72 and D-cache 74. When an I-line or D-line is added to the L1 I-cache 72 or D-cache 74, a corresponding entry may be placed in the I-cache directory 73 or D-cache directory 75. When an I-line or D-line is removed from the L1 I-cache 72 or D-cache 74, the corresponding entry in the I-cache directory 73 or D-cache directory 75 may be removed. While described below with respect to a D-cache 74 which utilizes a D-cache directory 75, embodiments of the invention may also be utilized where a D-cache directory 75 is not utilized. In such cases, the data stored in the D-cache 74 itself may indicate what D-lines are present in the D-cache 74.

In one embodiment, instruction fetching circuitry 89 may be used to fetch instructions for the processor core 81. For example, the instruction fetching circuitry 89 may contain a program counter which tracks the current instructions being executed in the core. A branch unit within the core may be used to change the program counter when a branch instruction is encountered. An I-line buffer 82 may be used to store instructions fetched from the L1 I-cache 72.

Instruction prioritization circuitry 83 may be used for optimizations which may be achieved from the ordering of instructions as described in greater detail below with regard to FIGS. 4 and 5. The instruction prioritization circuitry 83 can implement any number of different instruction optimization schemes, which is to first prioritize the instructions according to instruction type. The instruction prioritization circuitry 83, in one embodiment of the present invention, can invoke a second level priority optimization scheme which prioritizes the store instructions in the order that the program code originally ordered them.

Issue and dispatch circuitry 84 may be used to group instructions retrieved from the instruction prioritization circuitry 83 into instruction groups which may then be issued to the processor core 81 as described below. In some cases, the issue and dispatch circuitry may use information provided by the predecoder and scheduler 63 to form appropriate instruction groups.

In addition to receiving instructions from the issue and dispatch circuitry 84, the processor core 81 may receive data from a variety of locations. Where the processor core 81 requires data from a data register, a register file 86 may be used to obtain data. Where the processor core 81 requires data from a memory location, cache load and store circuitry 87 may be used to load data from the D-cache 74. Where such a load is performed, a request for the required data may be issued to the D-cache 74. At the same time, the D-cache directory 75 may be checked to determine whether the desired data is located in the D-cache 74. Where the D-cache 74 contains the desired data, the D-cache directory 75 may indicate that the D-cache 74 contains the desired data and the D-cache access may be completed at some time afterwards. Where the D-cache 74 does not contain the desired data, the D-cache directory 75 may indicate that the D-cache 74 does not contain the desired data. Because the D-cache directory 75 may be accessed more quickly than the D-cache 74, a request for the desired data may be issued to the L2 cache 61 (e.g., using the L2 access circuitry 62) after the D-cache directory 75 is accessed but before the D-cache access is completed.

In some cases, data may be modified in the processor core 81. Modified data may be written to the register file 86, or stored in memory 42 (FIG. 1). Write-back circuitry 88 may be used to write data back to the register file 86. In some cases, the write-back circuitry 88 may utilize the cache load and store circuitry 87 to write data back to the D-cache 74. Optionally, the processor core 81 may access the cache load and store circuitry 87 directly to perform stores. In some cases, as described below, the write-back circuitry 88 may also be used to write instructions back to the L1 I-cache 72.

As described above, the issue and dispatch circuitry 84 may be used to form instruction groups and issue the formed instruction groups to the processor core 81. The issue and dispatch circuitry 84 may also include circuitry to rotate and merge instructions in the I-line and thereby form an appropriate instruction group. Formation of issue groups may take into account several considerations, such as dependencies between the instructions in an issue group. Once an issue group is formed, the issue group may be dispatched in parallel to the processor core 81. In some cases, an instruction group may contain one instruction for each pipeline in the processor core 81. Optionally, the instruction group may a smaller number of instructions.

According to one embodiment of the invention, one or more processor cores 81 may utilize a cascaded, delayed execution pipeline configuration. In the example depicted in FIG. 3, the processor core 81 contains four pipelines in a cascaded configuration. Optionally, a smaller number (two or more pipelines) or a larger number (more than four pipelines) may be used in such a configuration. Furthermore, the physical layout of the pipeline depicted in FIG. 3 is exemplary, and not necessarily suggestive of an actual physical layout of the cascaded, delayed execution pipeline unit.

In one embodiment, each pipeline (P0, P1, P2, P3) in the cascaded, delayed execution pipeline configuration may contain an execution unit 94. In the example depicted in FIG. 3, pipeline P0 is the shortest delay pipeline, and pipeline P3 is the longest delay pipeline in the cascaded, delayed execution pipeline configuration. The execution unit 94 may contain several pipeline stages which perform one or more functions for a given pipeline. For example, the execution unit 94 may perform all or a portion of the fetching and decoding of an instruction. The decoding performed by the execution unit may be shared with a predecoder and scheduler 63 which is shared among multiple processor cores 81 or, optionally, which is utilized by a single processor core 81. The execution unit may also read data from a register file, calculate addresses, perform integer arithmetic functions (e.g., using an arithmetic logic unit, or ALU), perform floating point and arithmetic functions, execute instruction branches, perform data access functions (e.g., loads and stores from memory), and store data back to registers (e.g., in the register file 86). In some cases, the processor core 81 may utilize an instruction fetching circuitry 89, the register file 86, cache load and store circuitry 87, and write-back circuitry 88, as well as any other circuitry, to perform these functions.

In one embodiment, each execution unit 94 may perform the same functions. Optionally, each execution unit 94 (or different groups of execution units) may perform different sets of functions. Also, in some cases the execution units 94 in each processor core 81 may be the same or different from execution units 94 provided in other cores. For example, in one core, execution units 94A and 94C may perform load/ store and arithmetic functions while execution units 94B and 94D may perform only arithmetic functions.

In one embodiment, as depicted, execution in the execution units 94 may be performed in a delayed manner with respect to the other execution units 94. The depicted arrangement may also be referred to as a cascaded, delayed configuration, but the depicted layout is not necessarily indicative of an actual physical layout of the execution units. In such a configuration, where instructions (referred to, for convenience, as I0, I1, I2, I3) in an instruction group are issued in parallel to the pipelines P0, P1, P2, P3, each instruction may be executed in a delayed fashion with respect to each other instruction. For example, instruction I0 may be executed first in the execution unit 94A for pipeline P0, instruction It may be executed second in the execution unit 94B, for pipeline P1, and so on.

In one embodiment, upon issuing the issue group to the processor core 81, I0 may be executed immediately in execution unit 94A. Later, after instruction I0 has finished being executed in execution unit 94A, execution unit 94B, may begin executing instruction I1, and so on, such that the instructions issued in parallel to the processor core 81 are executed in a delayed manner with respect to each other.

In one embodiment, some execution units 94 may be delayed with respect to each other while other execution units 94 are not delayed with respect to each other. Where execution of a second instruction is dependent on the execution of a first instruction, forwarding paths 98 may be used to forward the result from the first instruction to the second instruction. The depicted forwarding paths 98 are merely exemplary, and the processor core 81 may contain more forwarding paths from different points in an execution unit 94 to other execution units 94 or to the same execution unit 94.

In one embodiment, instructions which are not being executed by an execution unit 94 (e.g., instructions being delayed) may be held in a delay queue 92 or a target delay queue 96. The delay queues 92 may be used to hold instructions in an instruction group which have not been executed by an execution unit 94. For example, while instruction I0 is being executed in execution unit 94A, instructions I1, I2, and I3 may be held in a delay queue 96. Once the instructions have moved through the delay queues 96, the instructions may be issued to the appropriate execution unit 94 and executed. The target delay queues 96 may be used to hold the results of instructions which have already been executed by an execution unit 94. In some cases, results in the target delay queues 96 may be forwarded to executions units 94 for processing or invalidated where appropriate. Similarly, in some circumstances, instructions in the delay queue 92 may be invalidated, as described below.

In one embodiment, after each of the instructions in an instruction group have passed through the delay queues 92, execution units 94, and target delay queues 96, the results (e.g., data, and, as described below, instructions) may be written back either to the register file 86 or the L1 I-cache 72 and/or D-cache 74. In some cases, the write-back circuitry 88 may be used to write back the most recently modified value of a register (received from one of the target delay queues 96) and discard invalidated results.

Scheduling Store Instructions

According to one embodiment of the invention, pipeline stalls due to cache misses may be reduced by executing store instructions in the least delayed pipeline (e.g., in the example described above, in pipeline P₀). Where the store instruction results in a D-cache miss, instructions issued after the store instruction may be invalidated and a request for data may be sent to the L2 cache 61. While the desired data is being fetched from the L2 cache 61, the store instruction may be reissued to the pipeline (e.g., pipeline P3) with the greatest delay in execution, and the invalidated instructions may be issued, either in the same issue group with the reissued instruction or in subsequent issue groups.

Executing the store instruction as described above may be beneficial in at least three respects. First, by initially executing the store instruction in the pipeline with the least delay in execution, a determination may be made quickly of whether the store instruction results in a D-cache miss. With an early determination of whether a D-cache miss results, fewer instructions issued to the pipeline (e.g., instructions in subsequent issue groups) may be invalidated and reissued. Second, by quickly determining whether the issued instruction results in an L1 cache miss, an L2 cache access may be initiated more quickly, thereby reducing any resulting stall in the pipeline while the L2 cache access is performed. Third, by reissuing the store instruction to the pipeline with the greatest delay, more time (e.g., while the store instruction is being moved through the delay queue 92 and before the instruction is re-executed by an execution unit 94) may be provided for the L2 cache access of the desired data to be completed, thereby preventing a stall of the processor core 81.

FIG. 4 is a block diagram depicting an instruction prioritization circuitry 83 according to one embodiment of the invention. The instruction prioritization circuitry 83 enables optimizations which may be achieved from the reordering of instructions as described in greater detail below with regard to FIG. 5. The instruction prioritization circuitry 83 can implement any number of different instruction optimization schemes including, but not limited to, a store instruction of a semaphore (highest priority), a store instruction update to the stack (i.e. auto increment to stack pointer) (second highest priority), a store instruction with dependent use of address (i.e. auto increment of an address) (third highest priority), a store instruction having address dependence (fourth highest priority), a store of a load with an address conflict (fifth highest priority), a store instruction with an update that is not to the stack (sixth highest priority), a store instruction of fixed, floating-point, floating graphic instructions (seventh highest priority), a store instruction defined as being end of dependent chain store instruction or nearly end of dependent chain store instruction (eight highest priority); and, lastly, the lowest priority store instruction is defined as being an independent store instruction with no dependency.

A second order prioritization can be implemented to resolve instances were store instructions are prioritized to the same pipeline. In one embodiment, the store instructions with issue conflicts are prioritized based upon program order. For example, those store instructions with an issue conflict are prioritized in the order that the program code originally ordered them. In another embodiment, the priority of store instructions with issue conflicts are determined by dependency chain depths or how many dependent loads/ALU instructions will follow this store instruction. In still another embodiment, the store instructions with issue conflicts can be prioritized based upon the stall delayed penalty.

An I-line buffer 82 may be used to store instructions fetched from the L1 I-cache 72. An I-line buffer 82 transfers the instructions to the instruction prioritization circuitry 83 for optimizations. Optimizations may be achieved from the ordering of instructions in any number of different instruction optimization schemes, including the one of the present invention, which is to utilize both a first level and second-level prioritization scheme for store instructions.

After receiving the instructions from the I-line buffer 82 the instruction prioritization circuitry 83 loads each instruction into a corresponding preliminary pipeline 101. Illustrated in FIG. 4 are eight pipelines P0 through P7 for example purposes only, however, it is understood that any number of instruction pipelines can be utilized. Each preliminary pipeline 101 includes the full instruction, instruction opcode, as well as a dependency load/multiply count and end of chain fields. The instruction information is then transferred through switching system 102 into multiplexer bank 103.

The opcode for each instruction in each pipeline is also transferred via busline 106 into the class conflict detection logic 104. The class conflict detection logic 104 determines if any of the instruction opcodes would resolve to the same instruction pipeline and informs the class selection logic 105 of any conflicts or collisions. The class selection logic 105 then utilizes the multiplexer bank 103 to reorder the instructions into the first reorder pipelines 109.

The first reorder pipelines 109 enable the instruction prioritization circuitry 83 to organize the higher priority instructions into the lower order or least delayed pipelines. In the illustrated example, the store instructions are first prioritized according to a store instruction of a semaphore (highest priority), a store instruction update to the stack (i.e. auto increment to stack pointer) (second highest priority), a store instruction with dependent use of address (i.e. auto increment of an address) (third highest priority), a store instruction having address dependence (fourth highest priority), a store of a load with an address conflict (fifth highest priority), a store instruction with an update that is not to the stack (sixth highest priority), a store instruction of fixed, floating-point, floating graphic instructions (seventh highest priority), a store instruction defined as being end of dependent chain store instruction or nearly end of dependent chain store instruction (eight highest priority); and, lastly, the lowest priority store instruction is defined as being an independent store instruction with no dependency.

The instruction information is then transferred through switching system 112 into multiplexer bank 113. The opcode for each instruction in each pipeline is also transferred via busline 116 into the same class conflict detection logic 114. The same class conflict detection logic 114 determines if any of the instruction opcodes would resolve to the same instruction pipeline and informs the same class selection logic 115 of any conflicts or collisions. The class selection logic 115 then utilizes the multiplexer bank 113 to reorder the instructions into the second reorder pipelines 119.

In the illustrated example, the store instructions are prioritized a second time using one of the following methods. In one embodiment, the store instructions with issue conflicts are prioritized based upon program order. For example, those store instructions with an issue conflict are prioritized in the order that the program code originally ordered them. In another embodiment, the priority of store instructions with issue conflicts are determined by dependency chain depths or how many dependent loads/ALU instructions will follow this store instruction. In still another embodiment, the store instructions with issue conflicts can be prioritized based upon the stall delayed penalty.

These instructions are then scheduled in a delayed execution pipeline. The re-ordered instruction group in the second reorder pipelines 119 is then transferred into the issue and dispatch circuitry 84. Issue and dispatch circuitry 84 may be used to group instructions retrieved from the instruction prioritization circuitry 83 into instruction groups which may then be issued to the processor core 81 as described below.

FIG. 5 is a flow chart illustrating an example of the operation of store instruction prioritization process 200 for executing instructions in the delayed execution pipeline according to one embodiment of the invention. In the illustrated example, the store instructions are first prioritized according to the priority order of store instructions. Next, the store instructions are checked for conflicts. In the case where conflicts occur (i.e. two or more store instructions issue to the same pipeline), a prioritization or tiebreaker process is performed.

First at step 201, the store instruction prioritization process 200 receives a group of instructions that are to be executed as a group. At step 203, all of the instructions in the group were evaluated to determine if one or more store instructions are present in the instruction group. At step 205, it is determined if the received instructions group contain store instructions. If it is determined at step 205 that there are not store instructions in the group, then the store instruction prioritization process 200 skips to step 219 to exit.

However, if it is determined that there are one or more store instructions in the instruction group at step 205, then the store instructions are selected out of the group at step 207. At step 211, all of the store instructions selected out of the issue group instruction group at step 207, are prioritized first according to: a store instruction of a semaphore (highest priority), a store instruction update to the stack (i.e. auto increment to stack pointer) (second highest priority), a store instruction with dependent use of address (i.e. auto increment of an address) (third highest priority), a store instruction having address dependence (fourth highest priority), a store of a load with an address conflict (fifth highest priority), a store instruction with an update that is not to the stack (sixth highest priority), a store instruction of fixed, floating-point, floating graphic instructions (seventh highest priority), a store instruction defined as being end of dependent chain store instruction or nearly end of dependent chain store instruction (eight highest priority); and, lastly, the lowest priority store instruction is defined as being an independent store instruction with no dependency.

The priority, instruction class and priority reason are shown in Table 1. Store Instruction Priority (0 is highest priority in this table).

TABLE 1 Priority Instruction Class Priority Reason 0 STCX Store conditional SMP Required to issue only to a single pipeline unit, semiphore/lock store p6 1 Update (auto-increment) store Must issue to pipeline p0 when possible as that increments the stack pointer these initiate many dependent chains 2 Stores with a load address Want these stores undelayed as much as conflict within the IQs possible because address dependent load must issue to the same pipe, and may have a dependent chain following it 3 Update store that increments a Few of these start a dependent chain register other than the stack pointer and has a dependent use 4 Update store that increments a Almost as good as a store without update register other than the stack (below), unlikely to ever stall pointer but likely has no close dependent use 5 Store without update Cannot have a dependent use can put to any pipeline always because it will not generate a stall

In one embodiment, each of the instructions in all cache levels has two flag fields used to a scheduling instructions that are on a dependent chained when two or more instructions in a group to be natively scheduled to the same pipeline. The first field is a count that indicates the number of serial dependent load/multiply instructions that follow the current instruction along a predicted path. The count can indicate 0, 1 or multiple dependent chained loads and multiplied instructions follow the current instruction. The second field is an end of chain field to indicate that this instruction has no dependent use of its result by a subsequent load, multiply or ALU instruction.

At step 213, it is determined if any issue conflicts exist. If it is determined at step 213 that no issue conflicts exist, then the store instruction prioritization process 200 skips to step 219 to exit. However, if it is determined that an issue conflicts exist, then a prioritization or tiebreaker process is performed at step 215. This prioritization or tiebreaker process is to determine which of the store issue conflict instructions is placed in the least delayed pipeline and the other store competing instructions placed in more delayed pipelines. In the exemplary embodiment, the store instructions with issue conflicts are prioritized based upon program order. For example, those store instructions with an issue conflict are prioritized in the order that the program code originally ordered them. In another embodiment, the priority of store instructions with issue conflicts are determined by dependency chain depths or how many dependent loads/ALU instructions will follow this store instruction. In still another embodiment, the store instructions with issue conflicts can be prioritized based upon the stall delayed penalty.

At step 217, the issue group may be issued to the I-Queue 85, and the store instruction prioritization process 200 then exits at step 219.

The present invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. As one example, one or more aspects of the present invention can be included in an article of manufacture (e.g., one or more computer program products) having, for instance, computer usable media. The media has embodied therein, for instance, computer readable program code means for providing and facilitating the capabilities of the present invention. The article of manufacture can be included as a part of a computer system or sold separately.

Furthermore, the invention can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.

The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk—read only memory (CD-ROM), compact disk—read/write (CD-R/W) and DVD.

It should be emphasized that the above-described embodiments of the present invention, particularly, any “preferred” embodiments, are merely possible examples of implementations, merely set forth for a clear understanding of the principles of the invention. Many variations and modifications may be made to the above-described embodiment(s) of the invention without departing substantially from the spirit and principles of the invention. All such modifications and variations are intended to be included herein within the scope of this disclosure and the present invention and protected by the following claims. 

1. A method of scheduling execution of an instruction in a processor having at least one cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other, the method comprising: receiving an issue group of instructions; determining if at least one store instruction is in the issue group, if so scheduling the least one store instruction in a one of the plurality of execution pipelines based upon a first prioritization scheme; determining if there is an issue conflict for one of the plurality of execution pipelines; resolving the issue conflict by scheduling all but one of the at least one store instruction causing the issue conflict in a different execution pipeline; scheduling execution of the issue group of instructions in the cascaded delayed execution pipeline unit.
 2. The method of claim 1, wherein the first prioritization scheme prioritizes the store instruction dealing with a semaphore as having a highest priority.
 3. The method of claim 1 wherein the first prioritization scheme prioritizes the store instruction dealing with an update to a stack as having a second highest priority.
 4. The method of claim 1, wherein the first prioritization scheme prioritizes the store instruction dealing with a dependent use of an address as having a third highest priority.
 5. The method of claim 1, wherein the first prioritization scheme prioritizes the store instruction dealing with an address dependence as having a fourth highest priority.
 6. The method of claim 1, wherein the first prioritization scheme prioritizes the store instruction dealing with an address conflict as having a fifth highest priority.
 7. The method of claim 1, wherein the first prioritization scheme prioritizes the store instruction dealing with an update that is not to a stack as having a sixth highest priority, and the store instruction dealing with a fixed, floating-point, and floating graphic instruction as having a seventh highest priority.
 8. The method of claim 1, wherein the first prioritization scheme prioritizes the store instruction dealing with being an end of chain store instruction as having a eighth highest priority, and the store instruction being an independent instruction with no dependency as having a lowest priority.
 9. The method of claim 1, wherein the resolving the issue conflict prioritizes the store instruction based upon program order.
 10. An integrated circuit device comprising: a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other; circuitry configured to: receive an issue group of instructions; determine if at least one store instruction is in the issue group, if so scheduling the least one store instruction in a one of the plurality of execution pipelines based upon a first prioritization scheme; determine if there is an issue conflict for one of the plurality of execution pipelines; resolve the issue conflict by scheduling one store instruction causing the issue conflict in a different execution pipeline; schedule execution of the issue group of instructions in the cascaded delayed execution pipeline unit.
 11. The integrated circuit device of claim 10, wherein the first prioritization scheme prioritizes the store instruction dealing with a semaphore as having a highest priority.
 12. The integrated circuit device of claim 10, wherein the first prioritization scheme prioritizes the store instruction dealing with an update to a stack as having a second highest priority.
 13. The integrated circuit device of claim 10, wherein the first prioritization scheme prioritizes the store instruction dealing with a dependent use of an address as having a third highest priority.
 14. The integrated circuit device of claim 10, wherein the first prioritization scheme prioritizes the store instruction dealing with an address dependence as having a fourth highest priority.
 15. The integrated circuit device of claim 10, wherein the first prioritization scheme prioritizes the store instruction dealing with an address conflict as having a fifth highest priority.
 16. The integrated circuit device of claim 10, wherein the first prioritization scheme prioritizes the store instruction dealing with an update that is not to a stack as having a sixth highest priority, and the store instruction dealing with a fixed, floating-point, and floating graphic instruction as having a seventh highest priority.
 17. The integrated circuit device of claim 10, wherein the first prioritization scheme prioritizes the store instruction dealing with being an end of chain store instruction as having a eighth highest priority, and the store instruction being an independent instruction with no dependency as having a lowest priority.
 18. The integrated circuit device of claim 10, wherein the resolving the issue conflict prioritizes the store instruction based upon program order.
 19. A processor device comprising: a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other; circuitry configured to: receive an issue group of instructions; determine if at least one store instruction is in the issue group, if so scheduling the least one store instruction in a one of the plurality of execution pipelines based upon a first prioritization scheme; determine if there is an issue conflict for one of the plurality of execution pipelines; resolve the issue conflict by scheduling one store instruction causing the issue conflict in a different execution pipeline; and schedule execution of the issue group of instructions in the cascaded delayed execution pipeline unit.
 20. The processor device of claim 19, wherein the resolving the issue conflict prioritizes the store instruction based upon program order.
 21. The processor device of claim 19, wherein the first prioritization scheme prioritizes the store instruction dealing with a semaphore as having a highest priority, the store instruction dealing with an update to a stack as having a second highest priority, the store instruction dealing with a dependent use of an address as having a third highest priority, the store instruction dealing with an address dependence as having a fourth highest priority, the store instruction dealing with an address conflict as having a fifth highest priority, the store instruction dealing with an update that is not to a stack as having a sixth highest priority, the store instruction dealing with a fixed, floating-point, and floating graphic instruction as having a seventh highest priority, the store instruction dealing with being an end of chain store instruction as having a eighth highest priority, and the store instruction being an independent instruction with no dependency as having a lowest priority. 